Rational Codes and Free Profinite Monoids
نویسندگان
چکیده
It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we show that a clopen submonoid is free profinite if and only if it is the closure of a rational free submonoid. In this case its unique closed basis is clopen, and is in fact the closure of the corresponding rational code. More generally, our results apply to free pro-H monoids for H an extension-closed pseudovariety of groups.
منابع مشابه
The Geometry of Profinite Graphs with Applications to Free Groups and Finite Monoids
We initiate the study of the class of profinite graphs Γ defined by the following geometric property: for any two vertices v and w of Γ, there is a (unique) smallest connected profinite subgraph of Γ containing them; such graphs are called tree-like. Profinite trees in the sense of Gildenhuys and Ribes are tree-like, but the converse is not true. A profinite group is then said to be dendral if ...
متن کاملAsh's Type II Theorem, Profinite Topology and Malcev Products: Part I
This paper is concerned with the many deep and far reaching consequences of Ash’s positive solution of the type II conjecture for finite monoids. After rewieving the statement and history of the problem, we show how it can be used to decide if a finite monoid is in the variety generated by the Malcev product of a given variety and the variety of groups. Many interesting varieties of finite mono...
متن کاملOn Profinite Uniform Structures Defined by Varieties of Finite Monoids
This paper arose during the preparation of [11], a paper on pro-p topologies extending the results of [12]. After recollecting various assertions on profinite topologies, we tried to improve existing statements and to arrange our notes into a readable form. We soon realized that many results were spread out in the literature, some of them not being stated in the way we wished and some other one...
متن کاملA Combinatorial Property of Ideals in Free Profinite Monoids
The second statement of Corollary 3 was first proved by Almeida and Volkov using techniques coming from symbolic dynamics [2]. Our next result generalizes a result of Rhodes and the author showing that all elements of finite order in F̂V(A) are group elements, which played a key role in proving that such elements are in fact idempotent [7]. Let N̂ denote the profinite completion of the monoid of ...
متن کاملA Profinite Approach to Stable Pairs
We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are also described for the pseudovariety of all finite monoids.
متن کامل